翻訳と辞書
Words near each other
・ Logic for Programming, Artificial Intelligence and Reasoning
・ Logic form
・ Logic game
・ Logic gate
・ Logic Group of Schools
・ Logic in China
・ Logic in computer science
・ Logic in Islamic philosophy
・ Logic Lane
・ Logic Lane covered bridge
・ Logic learning machine
・ Logic level
・ Logic Made Easy
・ Logic maze
・ Logic model
Logic of Argumentation
・ Logic of class
・ Logic of Computable Functions
・ Logic of Empire
・ Logic of graphs
・ Logic of information
・ Logic optimization
・ Logic Pro
・ Logic probe
・ Logic programming
・ Logic Programming Associates
・ Logic puzzle
・ Logic Quest 3D
・ Logic redundancy
・ Logic simulation


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Logic of Argumentation : ウィキペディア英語版
Logic of Argumentation

The Logic of Argumentation (LA) is a formalised description of the ways in which humans reason and argue about propositions. It is used, for example, in computer artificial intelligence systems in the fields of medical diagnosis and prognosis, and research chemistry.
Krause et al.〔Paul J. Krause, Simon Ambler, Morten Elvang-Gøransson, and John Fox, A Logic of Argumentation for Reasoning Under Uncertainty, Computational Intelligence, 1995, 11(1), 113-131.〕 appear to have been the first authors to use the term “logic of argumentation” in a paper about their model for using argumentation for qualitative reasoning under uncertainty, although the approach had been used earlier in prototype computer applications to support medical diagnosis.〔Morten Elvang-Gøransson, Paul J. Krause, and John Fox, Dialectic Reasoning with Inconsistent Information. in Uncertainty in Artificial Intelligence: Proceedings of the Ninth Conference, eds. D. Heckerman and A. Mamdani, Morgan Kaufmann, San Francisco, 1993, pp. 114-121.〕〔John Fox, David W. Glasspool, and Jonathan Bury, Quantitative and Qualitative Approaches to Reasoning under Uncertainty in Medical Decision Making, in 8th Conference on Artificial Intelligence in Medicine in Europe, AIME 2001 Cascais, Portugal, July 2001, Proceedings, eds. S. Quaglini, P. Barahone, and S. Andreassen, Springer, Berlin, 2001, pp 272-282.〕 Their ideas have been developed further,〔Philip N. Judson and Jonathan D. Vessey, A Comprehensive Approach to Argumentation, J. Chem. Inf. Comput. Sci., 2003, 43, 1356-1363.〕〔Leila Amgoud and Henri Prade, Towards a Logic of Argumentation, Lecture Notes in Comput. Sci., 2012, 7520, 558-565.〕 and used in applications for predicting chemical toxicity and xenobiotic metabolism, for example.〔Philip N. Judson; Carol A. Marchant; Jonathan D. Vessey. Using Argumentation for Absolute Reasoning about the Potential Toxicity of Chemicals. Journal of Chemical Information and Computer Science, 2003, 43, 1364-1370.〕〔William G. Button, Philip N. Judson, Anthony Long, and Jonathan D. Vessey. Using Absolute and Relative Reasoning in the Prediction of the Potential Metabolism of Xenobiotics, J. Chem. Inf. Comput. Sci., 2003, 43, 1371-1377.〕
In LA arguments for and arguments against a proposition are distinct; an argument for a proposition contributes nothing to the case against it, and vice versa. Among other things, this means that LA can support contradiction – proof that an argument is true and that it is false. Arguments supporting the case for and arguments supporting the case against are aggregated separately, leading to a single assessment of confidence in the case for and a single assessment of confidence in the case against. Then the two are resolved to provide a single measure of confidence in the proposition.
In most implementations of LA the default aggregated value is equal to the strongest value in the set of arguments for or against the proposition. Having more than one argument in agreement does not automatically increase confidence because it cannot be assumed that the arguments are independent when reasoning under uncertainty. If there is evidence that arguments are independent and there is a case for increased confidence when they agree, this is sometimes expressed in additional rules of the form “If A and B then ...”.
The process of aggregation and resolution can be represented as follows:
T = Resolve(ウィキペディア(Wikipedia)

ウィキペディアで「Logic of Argumentation」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.